Greedy Algorithms for Minimisation Problems in Random Regular Graphs
نویسنده
چکیده
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the minimum vertex cover (MVC), minimum independent dominating set (MIDS) and minimum edge dominating set (MEDS) problems. In almost all cases we are able to improve the best known results for these problems. Results for the MVC problem translate immediately to results for the maximum independent set problem. We also derive lower bounds on the size of an optimal MIDS.
منابع مشابه
Models of random regular graphs
This is a survey of results on properties of random regular graphs, together with an exposition of some of the main methods of obtaining these results. Related results on asymptotic enumeration are also presented, as well as various generalisations to random graphs with given degree sequence. A major feature in this area is the small subgraph conditioning method. When applicable, this establish...
متن کاملRandomized greedy algorithms for finding small k-dominating sets of regular graphs
A k-dominating set of a graph G is a subset D of the vertices of G such that every vertex of G is either in D or at distance at most k from a vertex in D. It is of interest to find k-dominating sets of small cardinality. In this paper we consider simple randomised greedy algorithms for finding small k-dominating sets of regular graphs. We analyse the average-case performance of the most efficie...
متن کاملOn the Links between Probabilistic Graphical Models and Submodular Optimisation. (Liens entre modèles graphiques probabilistes et optimisation sous-modulaire)
A probabilistic graphical model encodes conditional independences among random variables, which is related to factorisable distributions. Moreover, the entropy of a probability distribution on a set of discrete random variables is always bounded by the entropy of its factorisable counterpart. This is due to the submodularity of entropy on the set of discrete random variables. Submodular functio...
متن کاملRandomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs
A weakly-connected dominating set, W, of a graph, G, is a dominating set such that the subgraph consisting of V (G) and all edges incident with vertices in W is connected. Finding a small weaklyconnected dominating set of a graph has important applications in clustering mobile ad-hoc networks. In this paper we introduce several new randomised greedy algorithms for finding small weakly-connected...
متن کاملBounds on the max and min bisection of random cubic and random 4-regular graphs
In this paper, we present a randomized algorithm to compute the bisection width of cubic and 4-regular graphs. The analysis of the proposed algorithms on random graphs provides asymptotic upper bounds for the bisection width of random cubic and random 4-regular graphs with n vertices, giving upper bounds of 0:174039n for random cubic, and of 0:333333n for random 4-regular. We also obtain asympt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001